Toric Varieties and Lattice Polytopes

نویسنده

  • Ursula Whitcher
چکیده

We begin with a lattice N isomorphic to Z. The dual lattice M of N is given by Hom(N,Z); it is also isomorphic to Z. (The alphabet may appear to be going backwards; but this notation is standard in the literature.) We write the pairing of v ∈ N and w ∈M as 〈v, w〉. A cone in N is a subset of the real vector space NR = N ⊗R generated by nonnegative R-linear combinations of a set of vectors {v1, . . . , vn} ⊆ N . We assume that cones are strongly convex, that is, they contain no line through the origin. Note that each face of a cone is a cone. (Strictly speaking, our “cones in N” are “strongly convex rational polyhedral cones”.) Any cone σ in N has a dual cone σ† in M given by {w ∈MR | 〈v, w〉 ≥ 0∀ v ∈ σ}. A fan consists of a finite collection of cones such that each face of a cone in the fan is also in the fan, and any pair of cones in the fan intersects in a common face. Note the analogy to simplicial complexes. A (convex) polytope in a finite-dimensional vector space is the convex hull of a finite set of points. We are interested in lattice polytopes, for which this finite set of points– the polytope’s vertices– are contained in our integer lattice. Given a lattice polytope in N containing 0, we may construct a fan by taking cones over each face of the polytope. Given a lattice polytope K in N , we define its polar polytope K to be K = {w ∈M | 〈v, w〉 ≥ −1∀ v ∈ K}. If K is also a lattice polytope, we say that K is a reflexive polytope and that K and K are a mirror pair.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification of pseudo-symmetric simplicial reflexive polytopes

Gorenstein toric Fano varieties correspond to so called reflexive polytopes. If such a polytope contains a centrally symmetric pair of facets, we call the polytope, respectively the toric variety, pseudo-symmetric. Here we present a complete classification of pseudo-symmetric simplicial reflexive polytopes. This is a generalization of a result of Ewald on pseudosymmetric nonsingular toric Fano ...

متن کامل

Convex Lattice Polytopes and Cones with Few Lattice Points Inside, from a Birational Geometry Viewpoint

It is pretty well-known that toric Fano varieties of dimension k with terminal singularities correspond to convex lattice polytopes P ⊂ R of positive finite volume, such that P ⋂ Z consists of the point 0 and vertices of P (cf., e.g. [10], [36]). Likewise, Q−factorial terminal toric singularities essentially correspond to lattice simplexes with no lattice points inside or on the boundary (excep...

متن کامل

Lattice Points in Simple Polytopes

P (h) φ(x)dx where the polytope P (h) is obtained from P by independent parallel motions of all facets. This extends to simple lattice polytopes the EulerMaclaurin summation formula of Khovanskii and Pukhlikov [8] (valid for lattice polytopes such that the primitive vectors on edges through each vertex of P form a basis of the lattice). As a corollary, we recover results of Pommersheim [9] and ...

متن کامل

Examples of Non-symmetric Kähler-einstein Toric Fano Manifolds

Let us first recall our setting. In the toric case, there is a correspondence between n-dimensional nonsingular Fano varieties and ndimensional Fano polytopes, where the Fano varieties are biregular isomorphic if and only if the corresponding Fano polytopes are unimodularly equivalent. Here, given a lattice N of rank n, a Fano polytope Q ⊆ NR := N ⊗Z R is given as a lattice polytope containing ...

متن کامل

Lattice polytopes cut out by root systems and the Koszul property

We show that lattice polytopes cut out by root systems of classical type are normal and Koszul, generalizing a well-known result of Bruns, Gubeladze, and Trung in type A. We prove similar results for Cayley sums of collections of polytopes whose Minkowski sums are cut out by root systems. The proofs are based on a combinatorial characterization of diagonally split toric varieties.

متن کامل

CAYLEY DECOMPOSITIONS OF LATTICE POLYTOPES AND UPPER BOUNDS FOR h-POLYNOMIALS

We give an effective upper bound on the h-polynomial of a lattice polytope in terms of its degree and leading coefficient, confirming a conjecture of Batyrev. We deduce this bound as a consequence of a strong Cayley decomposition theorem which says, roughly speaking, that any lattice polytope with a large multiple that has no interior lattice points has a nontrivial decomposition as a Cayley su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006